11![A NEW RECURSION-THEORETIC CHARACTERIZATION OF THE POLYTIME FUNCTIONS Stephen Bellantoni and Stephen Cook Abstract. We give a recursion-theoretic characterization of FP which describes polynomial time computation independ A NEW RECURSION-THEORETIC CHARACTERIZATION OF THE POLYTIME FUNCTIONS Stephen Bellantoni and Stephen Cook Abstract. We give a recursion-theoretic characterization of FP which describes polynomial time computation independ](https://www.pdfsearch.io/img/ccf3814b5cb2cd440aaf006e0326d1a5.jpg) | Add to Reading ListSource URL: www.cs.utoronto.caLanguage: English - Date: 2002-02-28 13:39:49
|
---|
12![The Complexity of the Comparator Circuit Value Problem Stephen Cook Joint work with Yuval Filmus and Dai Tri Man Lˆe Department of Computer Science University of Toronto The Complexity of the Comparator Circuit Value Problem Stephen Cook Joint work with Yuval Filmus and Dai Tri Man Lˆe Department of Computer Science University of Toronto](https://www.pdfsearch.io/img/2dfacabe91f1ed7c8177330868e189bb.jpg) | Add to Reading ListSource URL: www.cs.utoronto.caLanguage: English - Date: 2014-08-07 14:28:20
|
---|
13![Theories for Subexponential-size Bounded-depth Frege Proofs Kaveh Ghasemloo and Stephen Cook Department of Computer Science University of Toronto Canada Theories for Subexponential-size Bounded-depth Frege Proofs Kaveh Ghasemloo and Stephen Cook Department of Computer Science University of Toronto Canada](https://www.pdfsearch.io/img/e7fbfe201018c946bc16eaacc1345302.jpg) | Add to Reading ListSource URL: www.cs.utoronto.caLanguage: English - Date: 2013-09-08 11:41:52
|
---|
14![JOURNAL OF COMPUTER AND SYSTEM SCIENCES 7, Time Bounded Random Access Machines STEPHEN A . COOK AND ROBERT A . RECKHOW Department of Computer Science, University of Toronto, Toronto, M S S 1A7, Ontario JOURNAL OF COMPUTER AND SYSTEM SCIENCES 7, Time Bounded Random Access Machines STEPHEN A . COOK AND ROBERT A . RECKHOW Department of Computer Science, University of Toronto, Toronto, M S S 1A7, Ontario](https://www.pdfsearch.io/img/950789766a8a2a1755b119f4ba02c67b.jpg) | Add to Reading ListSource URL: www.cs.utoronto.caLanguage: English - Date: 2010-08-22 18:04:17
|
---|
15![Complexity Theory for Operators in Analysis Akitoshi Kawamura Stephen Cook University of Toronto Complexity Theory for Operators in Analysis Akitoshi Kawamura Stephen Cook University of Toronto](https://www.pdfsearch.io/img/9fdfb5ca4ef2552e20e7822313dbe67c.jpg) | Add to Reading ListSource URL: www.cs.utoronto.caLanguage: English - Date: 2010-04-07 13:35:05
|
---|
16![The Hardness of Being Private Anil Ada∗ , Arkadev Chattopadhyay† , Stephen Cook† , Lila Fontes† , Michal Kouck´y‡ , Toniann Pitassi† † Department of Computer Science, University of Toronto, Toronto, Canada The Hardness of Being Private Anil Ada∗ , Arkadev Chattopadhyay† , Stephen Cook† , Lila Fontes† , Michal Kouck´y‡ , Toniann Pitassi† † Department of Computer Science, University of Toronto, Toronto, Canada](https://www.pdfsearch.io/img/5499d676164a983c6112e512f50ab3fe.jpg) | Add to Reading ListSource URL: www.cs.utoronto.caLanguage: English - Date: 2012-04-06 11:02:11
|
---|
17![Correction for “Pebbles and Branching Programs for Tree Evaluation”, by Stephen Cook, Pierre McKenzie, Dustin Wehr, Mark Braverman, and Rahul Santhanam, ACM ToCT (3,2), 2012. January, 2013 Theorem 5.15 in the above p Correction for “Pebbles and Branching Programs for Tree Evaluation”, by Stephen Cook, Pierre McKenzie, Dustin Wehr, Mark Braverman, and Rahul Santhanam, ACM ToCT (3,2), 2012. January, 2013 Theorem 5.15 in the above p](https://www.pdfsearch.io/img/b1c040282b0ed764ddb1bd83259e0d8f.jpg) | Add to Reading ListSource URL: www.cs.utoronto.caLanguage: English - Date: 2013-02-09 14:53:23
|
---|
18![A The Complexity of the Comparator Circuit Value Problem STEPHEN A. COOK, Department of Computer Science, University of Toronto YUVAL FILMUS, Department of Computer Science, University of Toronto DAI TRI MAN LÊ, Departm A The Complexity of the Comparator Circuit Value Problem STEPHEN A. COOK, Department of Computer Science, University of Toronto YUVAL FILMUS, Department of Computer Science, University of Toronto DAI TRI MAN LÊ, Departm](https://www.pdfsearch.io/img/0959e3af277d45f3bfacc0cd2ef98355.jpg) | Add to Reading ListSource URL: www.cs.utoronto.caLanguage: English - Date: 2015-02-17 12:39:22
|
---|
19![The Relative Efficiency of Propositional Proof Systems Author(s): Stephen A. Cook and Robert A. Reckhow Source: The Journal of Symbolic Logic, Vol. 44, No. 1 (Mar., 1979), ppPublished by: Association for Symbolic The Relative Efficiency of Propositional Proof Systems Author(s): Stephen A. Cook and Robert A. Reckhow Source: The Journal of Symbolic Logic, Vol. 44, No. 1 (Mar., 1979), ppPublished by: Association for Symbolic](https://www.pdfsearch.io/img/50fd0a15e85bc4adbf776a7b0095e2d2.jpg) | Add to Reading ListSource URL: www.cs.toronto.eduLanguage: English - Date: 2010-02-26 18:08:19
|
---|
20![A The Complexity of the Comparator Circuit Value Problem STEPHEN A. COOK, Department of Computer Science, University of Toronto YUVAL FILMUS, Department of Computer Science, University of Toronto DAI TRI MAN LÊ, Departm A The Complexity of the Comparator Circuit Value Problem STEPHEN A. COOK, Department of Computer Science, University of Toronto YUVAL FILMUS, Department of Computer Science, University of Toronto DAI TRI MAN LÊ, Departm](https://www.pdfsearch.io/img/d665ccc24217a274322a87ac55f65b3a.jpg) | Add to Reading ListSource URL: www.cs.toronto.eduLanguage: English - Date: 2015-02-17 12:39:22
|
---|